Packing Tight Hamilton Cycles in Uniform Hypergraphs

We say that a k-uniform hypergraph C is a Hamilton cycle of type `, for some 1 ≤ ` ≤ k, if there exists a cyclic ordering of the vertices of C such that every edge consists of k consecutive vertices and for every pair of consecutive edges Ei−1, Ei in C (in the natural ordering of the edges) we have |Ei−1 \ Ei| = `. We define a class of ( , p)-regular hypergraphs, that includes random hypergraphs, for which we can prove the existence of a decomposition of almost all edges into type ` Hamilton cycles, where ` < k/2.